Valid inequalities for problems with additive variable upper bounds
نویسندگان
چکیده
منابع مشابه
Valid Inequalities for Problems with Additive Variable Upper Bounds
We study the facial structure of a polyhedron associated with the single node re laxation of network ow problems with additive variable upper bounds This type of structure arises for example in network design expansion problems in production planning problems with setup times We rst derive two classes of valid inequalities for this polyhedron and give the conditions under which they are facet d...
متن کاملValid inequalities for problems with additive variable upper
We study the facial structure of a polyhedron associated with the single node relaxation of network flow problems with additive variable upper bounds. This type of structure arises, for example, in production planning problems with setup times and in network certain expansion problems. We derive several classes of valid inequalities for this polyhedron and give conditions under which they are f...
متن کاملValid Inequalities for Problems with Additive Variable Upper Bounds 1 2
We study the facial structure of a polyhedron associated with the single node relaxation of network ow problems with additive variable upper bounds. This type of structure arises for example in network design/expansion problems, in production planning problems with setup times. We rst derive two classes of valid inequalities for this polyhedron and give the conditions under which they are facet...
متن کاملValid inequalities for a class of assembly system problems
This paper establishes a foundation for a cutting plane approach to solve a class of problems that are important to assembly systems, including assembly line balancing (ALB), workload smoothing (WS) and assembly system design (ASD). We describe relationships among the integer programming formulations of these problems and recast their relaxations as node packing problems (NPPs). Exploiting the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2001
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s101070100235